Characterizing phylogenetically decisive taxon coverage

نویسندگان

  • Mike A. Steel
  • Michael J. Sanderson
چکیده

Increasingly, biologists are constructing evolutionary trees on large numbers of overlapping sets of taxa, and then combining them into a ‘supertree’ that classifies all the taxa. In this paper, we ask how much coverage of the total set of taxa is required by these subsets in order to ensure that we have enough information to reconstruct the supertree uniquely. We describe two results — a combinatorial characterization of the covering subsets to ensure that at most one supertree can be constructed from the smaller trees (whichever trees these may be) and a more liberal analysis that asks only that the supertree is highly likely to be uniquely specified by the tree structure on the covering subsets. © 2009 Elsevier Ltd. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Perfect taxon sampling and phylogenetically decisive taxon coverage

In a recent study, Steel and Sanderson defined and characterized phylogenetically decisive sets of taxon sets. A set is called phylogenetically decisive if regardless of the trees chosen for each of its taxon sets, as long as these trees are compatible with one another, their supertree is always unique. This implies that the sampled taxon sets always lead to a unique supertree, regardless what ...

متن کامل

SUMAC: Constructing Phylogenetic Supermatrices and Assessing Partially Decisive Taxon Coverage

The amount of phylogenetically informative sequence data in GenBank is growing at an exponential rate, and large phylogenetic trees are increasingly used in research. Tools are needed to construct phylogenetic sequence matrices from GenBank data and evaluate the effect of missing data. Supermatrix Constructor (SUMAC) is a tool to data-mine GenBank, construct phylogenetic supermatrices, and asse...

متن کامل

Combinatorial Challenge II

Please send further problems/challenges/conectures to Mike Steel Combinatorial Challenge I: Walking through trees Submitted by David Bryant An " NNI-­‐walk " is a sequence T1, T2, …, Tk of unrooted binary phylogenetic trees where each consecutive pair of trees differ by a single NNI. i. [Question] What is the shortest NNI walk that passes through all binary trees on n leaves? ii. [Question] Sup...

متن کامل

Identifying a species tree subject to random lateral gene transfer.

A major problem for inferring species trees from gene trees is that evolutionary processes can sometimes favor gene tree topologies that conflict with an underlying species tree. In the case of incomplete lineage sorting, this phenomenon has recently been well-studied, and some elegant solutions for species tree reconstruction have been proposed. One particularly simple and statistically consis...

متن کامل

Targeted Capture of Phylogenetically Informative Ves SINE Insertions in Genus Myotis

Identification of retrotransposon insertions in nonmodel taxa can be technically challenging and costly. This has inhibited progress in understanding retrotransposon insertion dynamics outside of a few well-studied species. To address this problem, we have extended a retrotransposon-based capture and sequence method (ME-Scan [mobile element scanning]) to identify insertions belonging to the Ves...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Appl. Math. Lett.

دوره 23  شماره 

صفحات  -

تاریخ انتشار 2010